The theory of interval probabilistic logic programs
نویسندگان
چکیده
منابع مشابه
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attrac tiveness of the former is in tying the logic programming research to the body of work on Bayes networks. The second approach ties computationally reasoning about probabilities with linear programming, and allows for natural expression of imprecision i...
متن کاملTemporal Probabilistic Logic Programs
There are many applications where the precise time at which an event will occur (or has occurred) is uncertain. Temporal probabilistic logic programs (TPLPs) allow a programmer to express knowledge about such events. In this paper, we develop a model theory, xpoint theory, and proof theory for TPLPs, and show that the xpoint theory may be used to enumerate consequences of a TPLP in a sound and ...
متن کاملProbabilistic Description Logic Programs
Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole’s independent choice...
متن کاملLearning the Structure of Probabilistic Logic Programs
There is a growing interest in the field of Probabilistic Inductive Logic Programming, which uses languages that integrate logic programming and probability. Many of these languages are based on the distribution semantics and recently various authors have proposed systems for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both the structure and the parameters (SEM-CP-logi...
متن کاملHybrid Probabilistic Logic Programs as Residuated Logic Programs
In this paper we show the embedding of Hybrid Probabilis-tic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the rst time a framework encompassing several qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2008
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-008-9104-7